Simple λΠ-interpreter for matrix computation

نویسنده

  • Nicholas Huang
چکیده

This project to extend the simply-typed Lambda calculus λ→ to have types dependent on constant value. In particular this language will be used to check the validity of matrix computation.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Embedding Pure Type Systems in the Lambda-Pi-Calculus Modulo

The lambda-Pi-calculus allows to express proofs of minimal predicate logic. It can be extended, in a very simple way, by adding computation rules. This leads to the lambda-Pi-calculus modulo. We show in this paper that this simple extension is surprisingly expressive and, in particular, that all functional Pure Type Systems, such as the system F, or the Calculus of Constructions, can be embedde...

متن کامل

Parametrization by polytopes of intersections of orbits by conjugation

Let S be an n×n real symmetric matrix with spectral decomposition S = Q ΛQ, where Q is an orthogonal matrix and Λ is diagonal with simple spectrum {λ1, . . . , λn}. Also let OS e RS be the orbits by conjugation of S by, respectively, orthogonal matrices and upper triangular matrices with positive diagonal. Denote by FS the intersection OS ∩RS . We show that the map F : F̄S → R n taking S′ = (Q) ...

متن کامل

A mathematically simple method based on denition for computing eigenvalues, generalized eigenvalues and quadratic eigenvalues of matrices

In this paper, a fundamentally new method, based on the denition, is introduced for numerical computation of eigenvalues, generalized eigenvalues and quadratic eigenvalues of matrices. Some examples are provided to show the accuracy and reliability of the proposed method. It is shown that the proposed method gives other sequences than that of existing methods but they still are convergent to th...

متن کامل

Programming an Interpreter Using Molecular Dynamics

PGA (ProGram Algebra) is an algebra of programs which concerns programs in their simplest form: sequences of instructions. Molecular dynamics is a simple model of computation developed in the setting of PGA, which bears on the use of dynamic data structures in programming. We consider the programming of an interpreter for a program notation that is close to existing assembly languages using PGA...

متن کامل

Octave: Past, Present, and Future

This paper outlines the history and development of GNU Octave, an interpreter for a high-level matrix-based language for numerical computations. A number of undesirable features of the current implementation are examined, and proposals for future development are presented.

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2017